Data structures and state tracking for network protocol processing

ABSTRACT

Described are data structures, and methodology for forming same, for network protocol processing. A method for creating data structures for firewalling and network address translating is described. A method for creating data structures for physical layer addressing is described. A method for security protocol support using a data structure is described. A method for creating at least one data structure sized responsive to whether a firewall is activated is described. A data structure for routing packets is described. A method of forming hashing table chains is described. Additionally, method and apparatus for tracking packet states is described. More particularly, Transmission Control Protocol (“TCP”) tracking of states for packets is described. In an embodiment, a division between software states and hardware states is made as a packet is processed by both software and hardware. Additionally, method and apparatus for network protocol processing are described. For example, a packet for network address translation having a media access control header is obtained, from which information, including the media access control header, is obtained. The information is parsed into one or more data structures. It is determined whether a network processing unit is in a first round processing mode, or a second round pass-through mode.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a divisional of co-pending U.S. patent applicationSer. No. 10/606,380, filed Jun. 24, 2003, which is herein incorporatedby reference.

FIELD OF THE INVENTION

One or more aspects of the invention generally relate to data structuresfor network protocol processing and more particularly, to cross-linkedtables for network protocol processing, including state tracking.

BACKGROUND OF THE INVENTION

The Internet remains a growing public network. Many companies rely oncommunication over the Internet using Internet Protocol (“IP”) tofacilitate their business endeavors. For security in communication overthe Internet, a computer may be configured to track and screencommunications. This configuration is known as a “firewall,” and one ormore of the actions of which may be referred to as “firewalling.”

In a “stateful firewall,” a set of values uniquely identifying eachexisting connection (“state of each active connection”) is maintained,subject to deactivation or disconnection. Conventionally, five valuesare used to form such a set. These five values are sometimescollectively referred to as a “five-tuple” entry. A five-tuple entryincludes respective values for IP Source Address, IP DestinationAddress, IP Protocol, Transport Layer Source Port (“Source Port”), andTransport Layer Destination Port (“Destination Port”). Examples of IPProtocols include User Datagram Protocol (“UDP”) and TransmissionControl Protocol (“TCP”). In a UDP or TCP packet, there are IP Sourceand Destination Addresses in the IP packet header. In a UDP or TCPpacket, Source and Destination Ports are in the UDP or TCP header,respectively, as well as an IP Protocol value indicating whether thepacket is a UDP or TCP packet. For clarity, a TCP packet is describedbelow, though it will be apparent that a UDP packet may be used.

In a connection using TCP (“a TCP connection”), namely, where TCPpackets are exchanged, there is a received packet (“an inbound packet”)and a sent packet (“an outbound packet”). Notably, five-tuple entriesfor inbound and outbound packets are the same except that Source andDestination Addresses are reversed, and Source and Destination Ports arereversed. Of course, in each of these two related five-tuple entries, IPProtocol is the same in both inbound and outbound packets.

In a stateful firewall, a data structure, such as an array, may haverespective columns indexed to five-tuple categories of information whereeach row represents an active connection. Additional columns may be useddepending on the level of detail used to evaluate each connection. Sucha data structure may be referred to as a “table,” indicating atabularized form of information whether or not headings are used.Five-tuple entries for inbound and outbound packets are stored in aconnection table. Connection table stored five-tuple entries are used tocompare against five-tuples of inbound and outbound packets to determinewhether or not the packets are for use with an existing connection.

When Network Address Translation (“NAT”) is employed, five-tupleinformation is stored to indicate Public IP Address and Public TransportLayer Port (“Public Port”) of a NAT configured device (“gateway”). Theterm “Public” is used to indicate that the address and port of thegateway are accessible from outside a local network associated with thegateway. The term “Remote” is used to indicate a device outside of alocal network of the gateway. Notably, the gateway device may be aseparate computer or installed in a “Local” computer. The term “Local”refers to a device on a local network of the gateway. For NAT, instancesof inbound packets to a NAT gateway, a five-tuple entry includes: an IPSource Address (“Remote IP Address”); an IP Destination Address (“PublicIP Address”); a Source Port (“Remote Source Port”); and a DestinationPort (“Public Destination Port”). For NAT, instances of outbound packetsto a NAT gateway, a five-tuple entry includes: an IP Source Address(“Local IP Address”); an IP Destination Address (“Remote IP Address”);Source Port (“Local Source Port”); Destination Port (“Remote DestinationPort”); and IP Protocol.

When an inbound packet having a five-tuple from a Remote device isreceived by a gateway where the five-tuple matches one stored in a NATtable, the gateway translates such an inbound packet for routing. Usingthe above describe convention, the five-tuple includes: IP SourceAddress (“Remote IP Address”); IP Destination Address (“Local IPAddress”); Source Port (“Remote Source Port”); Destination Port (“LocalDestination Port”); and IP Protocol. This is because a packet from aRemote device is sent to a gateway using Public information, which afterfound to be part of an active connection is used for address translationfor routing to a Local device.

When an outbound packet having a five-tuple from a local device isreceived by a gateway where the five-tuple matches one stored in a NATtable, the gateway translates such an outbound packet for routing. Usingthe above described convention, the five-tuple includes: IP SourceAddress (“Public IP Address”); IP Destination Address (“Remote IPAddress”); Source Port (“Public Source Port”); Destination Port (“RemoteDestination Port”); and IP Protocol. For clarity, the terms Remote,Local and Public are used below whether or not NAT is being used.

Furthermore, to enhance firewalling security, encrypted information maybe established for a connection. Examples of protocols for enhancedsecurity on the Internet include Point-to-Point Tunneling Protocol(“PPTP”) and a set of protocols known collectively as Internet ProtocolSecurity (“IPSec”). However, fragmentation of IP packets has been usedto defeat firewalls, such as the so-called “ping-of-death,” “wedge” and“tiny fragment” attacks. IP version 4 (“IPv4”) supports headerstructures allowing fragmentation of IP packets. Notably, a fragmentedpacket (“fragment”) may be fragmented further, and there is norequirement that fragments arrive in order, or even that they arrive atall. In many stateless firewalls, fragments are summarily process bydropping them. However, fragments are useful when an intermediate routerhas to forward a packet that is larger than the maximum transmissionunit (“MTU”) of an outgoing interface (“OIF”). Thus, by droppingfragments, information may be lost. Examples of stateless firewalls maybe found integrated in low-end home gateway routers. In higher-endstandalone or integrated stateful firewalls, more states are added toverify authenticity of a fragment. This approach facilitates use ofdevices with significant embedded memory limitations, using less memorythan a fragment buffering and reassembly approach.

Accordingly, it would be desirable to have a stateful firewall thatbuffers and reassembles fragments.

It should be appreciated that whether or not NAT is used a table lookupis done for each packet. Thus, computational cycles are spent for eachlookup and comparison of each five-tuple entry. Accordingly, a reductionin computational cycles for packet processing would be useful anddesirable.

SUMMARY OF THE INVENTION

An aspect of the invention is a method for creating data structures forfirewalling and network address translating. The method comprises:instantiating a first data structure and a second data structure;populating the first data structure with state information for a packet;populating the second data structure with packet information for thepacket; and cross-linking the first data structure and the second datastructure, where the cross-linking includes generating an index for thepacket information; and storing in the first data structure the index inassociation with the state information.

Another aspect of the invention is a method for creating data structuresfor physical layer addressing. The method comprises: instantiating afirst, a second and a third data structure; populating the first datastructure with state information; populating the second data structurewith network address translation information; populating the third datastructure with interface information; and cross-linking the first datastructure and the second data structure to the third data structure, thecross-linking including: generating an index for the interfaceinformation; and storing the index in the first data structure inassociation with the state information and in the second data structurein association with the network address translation information.

Another aspect of the invention is a method for security protocolsupport. The method comprises: creating a table, the table including afirst, a second and a third assigned data space; populating the firstassigned data space to indicate that a security protocol is being used;populating the second assigned data space with a first portion of asecurity protocol string; and populating the third assigned data spacewith a second portion of the security protocol string.

Another aspect of the invention is a method for creating at least onedata structure. The method comprises: determining if a firewall isactivated; determining if network address translator is activated; andcreating the at least one data structure responsive to one of: thefirewall and the network address translator being activated; thefirewall being activated and the network address translator not beingactivated; and the firewall not being activated and the network addresstranslator being activated.

Another aspect of the invention is a data structure for routing packets.The data structure comprises: an Internet Protocol destination addressdata space for storing Internet Protocol destination addresses; anInternet Protocol source address data space for storing InternetProtocol source address; and an address resolution table index dataspace for storing indices to an address resolution table, where theaddress resolution table includes a media access control address dataspace for storing media access control addresses.

Another aspect of the invention is a method of forming hashing tablechains. The method comprises: obtaining a first connection hash value,the first connection hash value pointing to a first slot in the hashingtable; obtaining a second connection hash value, the second connectionhash value pointing to the first slot in the hashing table; assigningthe second connection hash value to a second slot in the hashing table;pointing the first slot toward the second slot; obtaining a thirdconnection hash value, the third connection hash value pointing to thesecond slot in the hashing table; moving contents of the second slot toa third slot in the hashing table; and assigning the third connectionhash value to the second slot in the hashing table.

Another aspect of the invention is a method for tracking packet states,comprising: initiating tracking of state from a CLOSED state; from thefirst CLOSED state, tracking transition to a LISTEN state or a SYN-SENTstate; from the LISTEN state, tracking transition to one of the firstCLOSED state, a SYN-RCVD state or the SYN-SENT state; from the SYN-RCVDstate, tracking transition to either a first hardware state or aSYN-RCVD-SYN-SENT state; from the SYN-SENT state, tracking transition toeither a second hardware state or the SYN-RCVD-SYN-SENT state; from theSYN-RCVD-SYN-SENT state, tracking transition to either a firstSYN-RCVD-SYN-SENT-ACK state or a second SYN-RCVD-SYN-SENT-ACK state; andfrom either the first SYN-RCVD-SYN-SENT-ACK state or the secondSYN-RCVD-SYN-SENT-ACK state, tracking transition to a third hardwarestate.

Another aspect of the invention is an apparatus for tracking packetstates, comprising: means for initiating tracking of state from a firstCLOSED state; means for tracking software states for packets; and meansfor tracking hardware states for the packets. The means for trackingsoftware states for tracking the packets to one of a first, a second anda third hardware state: the first hardware state being aSYN-RCVD-SYN-ACK-SENT state, the second hardware state beingSYN-SENT-SYN-ACK-RCVD state, and the third hardware state being aconnection-established state. The means for tracking hardware statesincluding: means for tracking transition to the connection-establishedstate from the SYN-RCVD-SYN-ACK-SENT state; means for trackingtransition to the connection-established state from theSYN-SENT-SYN-ACK-RCVD state; means for tracking transition to a firstFIN-WAIT state from the SYN-RCVD-SYN-ACK-SENT state, theSYN-SENT-SYN-ACK-RCVD state or the connection-established state; andmeans for tracking transition to a CLOSE-WAIT-FIN state from theSYN-RCVD-SYN-ACK-SENT state, the SYN-SENT-SYN-ACK-RCVD state or theconnection-established state.

An aspect of the invention is a method for network protocol processing.The method comprises: obtaining a packet for network addresstranslation, the packet having a media access control header; obtaininginformation, including the media access control header, from the packet;parsing out the information into one or more data structures;determining if a network processing unit is in a pass-through moderesponsive to the media access control header; and responsive to thenetwork processing unit not being in the pass-through mode: determiningwhether multicast or broadcast is active, and determining whether aprotocol type for the packet is supported by the network processingunit.

BRIEF DESCRIPTION OF THE DRAWINGS

Accompanying drawing(s) show exemplary embodiment(s) in accordance withone or more aspects of the invention; however, the accompanyingdrawing(s) should not be taken to limit the invention to theembodiment(s) shown, but are for explanation and understanding only.

FIG. 1 is a block diagram of an exemplary embodiment of an addresstranslation flow.

FIGS. 2A-1, 2A-2, 2B-1, 2B-2, 2C, 2D-1 and 2D-2 are respective flowdiagrams of respective exemplary embodiments of portions of the addresstranslation flow of FIG. 1.

FIGS. 3A, 3B and 3C are flow diagrams of respective exemplaryembodiments of bridging and routing flows.

FIG. 4A is a flow diagram of an exemplary embodiment of a NetworkAddress Translation (“NAT”) filtering flow.

FIG. 4B is a flow diagram of an exemplary alternative embodiment of aportion of NAT filtering flow of FIG. 4A.

FIGS. 5A and 5B are flow diagram of a respective exemplary embodiment ofoutbound filtering flows.

FIGS. 6, 7, 8 and 9A are table entry diagrams for respective exemplaryembodiments of tables for which information may be stored.

FIG. 9B is a flow diagram depicting an exemplary embodiment of a statetable creation flow.

FIG. 10 is a state transition diagram of an exemplary embodiment of astate tracking flow.

FIG. 11 is a flow diagram of an exemplary embodiment of portion of adata structure population flow.

FIG. 12A is a block diagram of an exemplary embodiment of a networkprocessor unit (“NPU”).

FIG. 12B is a flow diagram of an exemplary embodiment of a packetprocessing flow for processing bursts of packets.

FIG. 13 is a block diagram of an exemplary embodiment of a computersystem.

FIG. 14 is a block diagram of an exemplary embodiment of a network.

FIGS. 15A and 15B are block diagrams depicting exemplary embodiments ofrespective tables indexed by hash function output values.

FIG. 16 is a flow diagram of an exemplary embodiment of a fragmentprocessing flow.

FIG. 17 is a block diagram of an exemplary embodiment of a buffer stack.

DETAILED DESCRIPTION OF THE DRAWINGS

In the following description, numerous specific details are set forth toprovide a more thorough understanding of aspects of the invention asdescribed with respect to exemplary embodiments herein. However, it willbe apparent to one of skill in the art that one or more aspects of theinvention may be practiced without one or more of these specificdetails. In other instances, well-known features have not been describedfor purposes of clarity.

FIG. 1 is a block diagram of an exemplary embodiment of an addresstranslation flow 100. Address translation flow 100 includes respectiveflows or subroutines. A packet is interrogated with packet interrogationflow 120. Output from packet interrogation flow 120 is sent to NetworkProcessor Unit (“NPU”) Mode A flow 140. Output from NPU Mode A flow issent to NPU Mode B flow 160. Output from NPU Mode B flow 160 is sent tocompose packet flow 180. Let it be understood that address translationflow 100 may be instantiated in hardware, software or a combination ofhardware and software. For clarity, address translation flow 100 isdescribed as an implementation of a combination of hardware andsoftware.

FIGS. 2A-1, 2A-2, 2B-1, 2B-2, 2C and 2D-1 (singly and collectively “FIG.2”) are respective flow diagrams of respective exemplary embodiments ofportions of address translation flow 100 of FIG. 1. A packet 101 of atransmission is received. Multiple packets corresponding to multipleconnections may be processed at a time for address translation flow 100of FIG. 1, though for purposes of clarity processing of a single packetis described. This is consistent with how packets are received for aconnection, namely, one packet at a time. Notably, if a plurality ofpackets is received in a short span of time, such packets may bebuffered as described below with respect to an NPU. Furthermore, FIG. 2for the most part is described with respect to an address translatorportion of an NPU, and accordingly receiving and transmitting is oftendone with reference to information going to and from, respectively, theaddress translator portion.

At 102 a determination as to whether address translation is supported inhardware, such as with an address translator in an NPU. If hardware doesnot support address translation, a received packet is sent to softwareproviding at least a portion of NPU functionality (“NPUsoft”) with errorcondition (“E”) 103. NPUsoft represents handling of a packet as embodiedin software. For clarity, NPUsoft activity in instances is not describedin any detail because either such processing follows from description ofthe hardware implementation or such processing is conventional. If,however, hardware does support address translation, then at 104optionally a determination as to whether an audit mode is in an activestate. Notably, an audit mode is generally for testing, and thus neednot be employed in a tested product. If an audit mode is in an activestate, then a determination is made at 105 as to whether packet 105 is a“re-inserted” packet. By “re-inserted” packet, it is meant a packetmoved out of address translation flow 100 with respect to hardwareprocessing for processing by software, NPUsoft, prior to beingre-inserted back into address translation flow 100.

If at 105, packet 101 is not a re-inserted packet, namely, this is thefirst time packet 101 has been partially processed by addresstranslation flow 100, then packet 101 is sent to NPUsoft with errorcondition 106. This allows packet 101 to be tested, such as by a hostcomputer system programmed with NPUsoft, prior to further processing inhardware for compatibility with such hardware. If, however, packet 101has previously been partially processed with address translation flow100 or an audit mode is not active, then at 107 a determination is madeas to whether information may be obtained from packet 101. Ifinformation may be readily obtained from packet 101, then suchinformation is processed at 107. At 107, a packet is broken out into adata structure for parsing information into distinct fields, such as fora table. This alternate representation of a packet may be done insoftware for purposes of building tables of information. Tables that mayused for FIG. 2 are described in additional detail with reference toFIGS. 6, 7, 8 and 9A.

FIGS. 6, 7, 8 and 9A are table entry diagrams for respective exemplaryembodiments of tables for which information, such as from a packet 101of FIG. 2, may be stored. FIG. 11 is a high-level flow diagram of anexemplary embodiment for a data structure population flow 850. Datastructure population flow 850 is described with simultaneous referenceto FIGS. 2, 6, 7, 8 and 9A.

If packet 101 is an inbound or outbound packet from which informationmay be obtained, then at 811 packet information, such as five-tuple, isobtained. Additionally, interface information relative to packet 101,such as Media Access Control (“MAC”) information, may be obtained at811.

At 812, respective indices are generated using packet informationobtained at 811. At 813, packet information, interface information andindices are stored in data structures. Examples of data structures areConnection Table (“CT”) 600, or if NAT is being used, NAT Table (“NT”)700. Interface information is stored in Address Resolution Table (“ART”)800. For example, an index generated from five-tuple information isstored in either CT 600 or NT 700 for cross-linking such tables, asdescribed below in additional detail. For example, an index generatedfrom an entry in ART 800, for example by hashing all or a portion of anentry of interface information, is stored in CT 600, or in NT 700 if NATis being used, for cross-linking with ART 800, as described below inadditional detail. Additionally, such an ART index may be stored in ART800 to avoid recalculation of such an index, for example when updatingan auxiliary Canonical Frame Header (“xCFH”) of packet 101 forbroadcasting, as described below in additional detail. A CFH is a datastructure, separate from packet 101, that travels with packet 101, wheredata for a CFH is derived from packet 101, as described below inadditional detail. Moreover, an ART index from such interfaceinformation is stored in Routing Table (“RT”) 900 for cross-linking withART 800, as described below in additional detail.

It should be noted that CT 600, NT 700 and RT 900 are linked to ART 800via ART index 601. Thus, CT 600, NT 700 and RT 900 are somewhatdependent on ART 800. For example, there may be one or more than one CTentry linked to the same ART entry. It should be further noted that CT600 is linked to NT 700 via NT index 606, and it should further be notedthat NT 700 is linked to CT 600 via CT index 706. Thus, CT 600 and NT700 are cross-linked.

Rather than having one large state table or other data structure for CT600 and NT 700 information, two linked state tables are used to conservememory. For example, if NAT is not being used, whether supported or not,many entries in a single state table may be left blank. Accordingly, bypopulating a smaller table with higher usage efficiency, memory usage isreduced over use of a larger table with lower usage efficiency. However,it should be understood that one or more of state tables 600, 700, 800,and 900 may be combined. However, for purposes of clarity, separatestate tables 600, 700, 800, and 900 are described. Notably, CT 600 andNT 700 may be created according to whether firewalling or NAT is active.Referring to FIG. 9B, there is shown a flow diagram depicting anexemplary embodiment of a state table creation flow 910. State tablecreation flow 910 may, for example, be instantiated in software forcreation of state tables 600, 700, 800, and 900. A command, such ascreate data structures 903, may be initiated as part of a startup mode.At 904, it is determined whether NAT is active. If NAT is active, CT 600and NT 700 are created to allow for NAT, and CT 600 is used for trackingTCP state. Notably, TCP state is tracked whether or not firewalling isactive. After which, state table creation flow 910 returns at 906. IfNAT is not active, then at 905 CT 600 is created if firewalling isactive for tracking TCP state information. If the firewall is notactive, CT 600 is not created. At 906, state table creation flow 910returns.

It should be understood that for NAT to take place, a packet needs to bein compliance with a NAT protocol. Accordingly, if a packet were not incompliance, such a communication would fail. Thus, to reduce or avoidfirewall processing of invalid packets, FIG. 2 is described as beingdone in front of a firewall. Thus, firewall policies may be instantiatedin an address translator portion of an NPU, as described below inadditional detail, and pointing from a NT 700 to a firewall datastructure may be postponed until confirmation that such a packet is incompliance for NAT. This is more evident with respect to the descriptionof output filtering below.

For a non-NAT connection, information stored in CT 600 generallyincludes an IP Protocol 607, a Remote IP Address 602, a Remote Port 605,a Local IP Address 604 and a Local Port 607. For a NAT connection,information stored in NT 700 typically includes an IP Protocol 607, aRemote IP Address 602, a Remote Port 605, a Public IP Address 704 and aPublic Port 707. Notably, an inbound or outbound packet is either aremote or local packet, and thus entries for such packets may be “remotefive-tuple” and “local five-tuple” entries for inbound or outboundpackets. Thus, it should be appreciated that for inbound packets: RemoteIP Address 602 are IP source addresses; Public IP Addresses 704 andLocal IP Addresses 604 are IP destination addresses; Remote Ports 605are source ports; and Public Ports 707 and Local Ports 607 aredestination ports. Furthermore, it should be appreciated that foroutbound packets: Local IP Addresses 604 and Public IP Addresses 704 areIP source addresses; Remote IP Addresses 602 are IP destinationaddresses; Local Ports 607 and Public Ports 707 are source ports; andRemote Ports 605 are destination ports. There are some exceptions tothis for handling security protocol packets.

Additionally, for a stateful firewall, at least a TCP state 609 for eachconnection may be stored in CT 600. Other known attributes, such assequence numbers, acknowledgment numbers, and window size, among otherknown state variables, may be stored in CT 600. These other attributesmay be associated with a five-tuple entry. For example, additionally aSequence Number 610 for each inbound and outbound packet may be storedin CT 600. Notably, TCP State in addition with other state attributesmay be stored only in CT 600 even though NAT is being used. Recall fromabove, that two smaller tables are used rather than a single largetable. Accordingly, attributes for stateful firewalling may be stored inone location, namely, CT 600.

If a secure connection has been established, such as with IPSec or PPTP,then a portion of an inbound five-tuple, whether non-NAT or NAT, may beencoded. Accordingly, either a Security Parameters Index (“SPI”) orGeneric Routing Encapsulation (“GRE”) Call Identification (“GRE CallID”) 603 run over an IPSec or PPTP, may be stored in CT 600, or NT 700if NAT is being used. However, encryption, decryption, compression ordecompression may be done in a sequence processor portion of an NPU, andthus packet 101 is presumed to be in a non-encrypted and non-compressedstate for FIG. 2, to the extent a security protocol allows. Because someinformation of a security protocol is encrypted, other information isused instead. For example, in CT 600 or NT 700, SPI/GRE Call ID 603 is aflag used to indicate that no security protocol is being used or thateither an SPI or GRE Call ID is being used, where the index or callidentification is actually broken out into two portions, one portion ofwhich is stored in a remote port data space and another portion of whichis store in a public port data space. An example of use of IPSec and NATis describe in co-pending U.S. patent application entitled “METHOD ANDAPPARATUS FOR SECURITY PROTOCOL AND ADDRESS TRANSLATION INTEGRATION” byThomas A. Maufer, Sameer Nanda, and Paul J. Sidenblad, filed Jun. 13,2002, application Ser. No. 10/172,352, which is incorporated byreference as though fully set forth herein, NAT may be used with asecurity protocol.

Indices are computed for each CT 600 entry, each NT 700 entry and eachART 800 entry. A CT Index 706 and an ART Index 601 are stored in NT 700.An NT Index 606 and an ART Index 601 are stored in CT 600. An ART Index601 is stored in RT 900. Indices are computed by hashing values for anentry, for example for a five-tuple entry in CT 600 or NT 700. A hash ofan entry or portion thereof represents an index to that entry in thattable. For example, a hash of a five-tuple forming a portion of an entrymay be used as an index to the entry. Indices are stored in tables inassociation with a corresponding entry. Accordingly, tables arecross-linked through such indices, except for ART 800 which does notneed to be cross-linked.

Computational cycles are expended for an initial table lookup. However,by creating and storing table entry indices, entries are cross-linked.For example, each NT entry is cross-linked with a corresponding CTentry, and each CT entry is cross-linked with a corresponding NT entry.Following a link to a corresponding entry in another table is lesscomputationally intensive than looking up an entry by checking formatches of a plurality of values, such as a five-tuple, each time atable is accessed. Additionally, by storing a hash of an entry,re-computation of such a hash is avoided thereby reducing use ofcomputational resources.

CT 600 and NT 700 each store links to ART 800 via ART index 601. ARTindex 601 is a hash of an entry in ART 800. In this manner, CT 600 andNT 700 are respectively cross-linked with ART 800. ART 800 storesinformation associated with delivery of packet 101, namely, a MACaddress and other MAC-layer attributes. For example, a MAC Address 801,a Virtual Local Area Network (LAN) Identification (ID) 802 and anInterface Mask 803 may be stored in ART 800. MAC Address 801 is a nextdestination address for packet 101, which may be a next hop finaldestination or a next hop toward the final destination address.

It is less computationally intensive to follow a link corresponding toan ART entry than hashing a packet's destination address, such as an IPDestination Address 901. By storing an ART index 601 for each ART 800entry in RT 900 along with an IP Destination Address 901, a MAC Address801, as well as other MAC-layer attributes, from ART 800 is linked tosuch IP Destination Address 901. Thus, it should be appreciated thatonce a match to an index is found in CT 600 or NT 700, an ART index maybe obtained leading to a next hop IP Destination Address 901 or MACAddress 801. Thus, once entries for packet and interface information areinstantiated for a first packet of a connection, all subsequent packetsmay be processed by hashing information for matching an index. Hashesfor indices 601, 606 and 706, may be done responsive to initializationof an associated state table entry for a first packet sent with respectto a connection. By saving computed indices for a connection, with asingle hash for each subsequent packet for such connection, translationor forwarding data for each subsequent packet may be found by linking toan appropriate table entry, using subsequent packet hashing. Notably, RT900 may be used when a routing only condition exists. Thus, if one orboth of firewalling and network address translating (“NAT'ing”) is done,then RT 900 may be bypassed as CT 600 and NT 700 are linked with ART 800via ART Index 601.

Accordingly, performance in packet processing is enhanced, and thusthroughput is increased. Furthermore, as described with respect to useof a parallel data structure, namely, an xCFH data structure thattravels with packet 101, indices are embedded to further enhance packetforwarding, namely, routing or bridging.

It is possible that a same hash results from two or more respectiveentries. Accordingly, as a failsafe measure, after an entry has beenaccessed by finding a match of a hash of a received packet as an indexin a state table, a comparison of such currently received packet'sinformation to packet information for a previously received packet for aconnection stored in such state table may be made. For example, acomparison of five-tuples may be done responsive to a match of such ahash of a received packet to a stored index. Though this adds additionaloverhead, it is still less computationally intensive for example thancomparing what potentially may be an entire table of five-tuples to afive-tuple of a currently received packet. Moreover, by having separatetables, fewer entries within a table need to be checked for matches.Furthermore, hash function output values, as described below, may beemployed as table indices.

With the above-described context, the remainder of address translationflow 100 with respect to FIG. 2 is described.

Returning to FIG. 2, if, at 107, information cannot readily be obtainedfrom packet 101, then at 114 a determination is made as to whether sucha packet 101 may continue to be processed with packet interrogation flow120. For example, at 108 a check may be made as to whether packet 101 ispart of a non-data over-the-air (“wireless”) frame. Notably, the packetinterrogator is described in terms of a parser of wireless data framesand not as being configured to parse non-data wireless frames, asdescribed below in additional detail. If packet 101 is part of anon-data wireless frame, then packet 101 is sent to NPUsoft with errorcondition 110. If packet 101 is not part of a non-data wireless frame,then at 109 a check may be made to determine if a frame used for sendingpacket 101 was insufficient, namely, too short. If such a frame was tooshort, then packet 101 is sent to NPUsoft with error condition 111. Ifthe frame was not too short, then at 113 a check for another abort codemay be made. If another abort code is found for packet 101, then packet101 is sent to NPUsoft with an error condition for such other abortcode, for example error condition 112. Notably, error conditions 111 and112 may lead to dropping packet 101 if too incomplete to process.Recall, packet 101 is now formatted in a data structure that is morereadily parsed.

Alternatively, a packet interrogation flow alternative is shown in FIGS.2A-2, where wireless flow 118 includes checking for a non-data wirelessframe 108. However, if it is not a non-data wireless frame at 108, thenpacket 101 is sent to NPUsoft with error condition 110. If it is anon-data wireless frame at 108, then at 115 it is determined if theframe came from the host computer or device. If the frame came from thehost at 115, then packet 101 is transmitted at 157. Otherwise, if theframe did not come for the host as detected at 115, packet 101 is sentto NPUsoft with error condition 117. In other words, if a non-datawireless frame came from wire, it is not put back on wire. Thus,non-data wireless frames are only transmitted by an address translation(“AT”) subunit of an NPU if they came from a host device, wherefirewalling and NAT are bypassed for such transmission. However,alternatively, the packet interrogator may be configured to parsenon-data wireless packets, and state could be tracked for such parsednon-data wireless packets.

With continuing reference to FIG. 2, at 116, a determination is made asto whether an NPU is in a Pass-through Mode A. Pass-through Mode A is apass-through mode with frame conversion only, which may be determinedfrom a MAC header of packet 101. Thus, if only a frame conversion isneeded for bridging, a significant portion of address translation flow100 may be bypassed. If an NPU is in pass-through Mode A, then at 156packet 101 is composed, namely, header format is converted, for examplefrom an IP format to an Ethernet format. Such composed packet 158 istransmitted at 156, for example to a firewall module of an addresstranslator or a sequence processor portion of such an NPU.

If Pass-through Mode A is not invoked, then at 121 a determination ismade as to whether multicast reception is active on an IncomingInterface (“IIF”) for a group of listeners of a multicast. If multicastreception is not active, then packet 101 is sent to NPUsoft with anerror condition, for example error condition 122.

At 123, a data link layer (“layer-2”) validity check is done. A layer-2validity check determines whether a MAC source address is a multicastMAC address and whether there is a length error for a frame used forsuch a MAC address. Additionally, a layer-2 validity check may involvechecking whether a report, which may be termed a “cracker report,”generated as a result of obtaining information at 107 indicated an errorin an xCFH for packet 101. If at 123, packet 101 is found to be invalidas a result of a layer-2 validity check, then packet 101 is sent toNPUsoft with an error condition, for example error condition 124.

A packet 101 determined to be valid at 123 is checked at 125 for packetprotocol type and protocol support on the IIF. If IP protocol of packet101 is not supported by a network processing unit, then packet 101 issent to NPUsoft with an error condition, for example error condition126.

Alternatively, an NPU mode A flow 140A may be used. Referring to FIGS.2B-2, for an NPU not in pass through mode A, at 128 a determination ismade as to whether a frame for packet 101 is a multicast or broadcastframe. If such a frame is a multicast or broadcast frame, then a checkfor multicast or broadcast active on the IIF is made at 121, aspreviously described. Otherwise, if such a frame is not a multicast orbroadcast frame, then at 125 a check for a supported protocol is made aspreviously described. Notably, layer-2 validity checking is not donehere in this alternative, as layer-2 validity checking may be moved anddone with layer-3 validity checking as described below with respect tofiltering.

If IP protocol of packet 101 is supported, then at 127 it is determinedwhether an NPU is in Pass-through Mode B. Pass-through Mode B is apass-through with firewall-only mode. This may be determined byaccessing a data structure, such as a table, indicating whetherfirewalling-only has been activated for packet 101. If such an NPU is inPass-through Mode B, a check is made at 153 of FIG. 2C to determine ifpacket 101 is a non-IP protocol packet. If, however, such an NPU is notin Pass-through Mode B, then other processing occurs prior to checkingwhether packet 101 is a non-IP protocol packet.

Referring to FIG. 2, and in particular FIG. 2C, at 131, optionally ahash of interface information of packet 101 is done, otherwise a lookupis done by comparing MAC source addresses. If a hash is done, the resultmay be stored as an ART Index in an xCFH for data path flow with packet101. Assuming a hash is not done, a check is made to determine if a MACsource address for a frame obtained from packet 101 is in an ART, suchas ART 800 of FIG. 8. If a MAC source address for packet 101 is not inART 800, for example if packet 101 is an initial packet of a connection,then packet 101 is sent to NPUsoft with an error condition, for exampleerror condition 132, meaning that ART entries need to be built for thispacket 101. In addition to such an error message, optionally the hash ofpacket 101, if optionally done, may be sent to NPUsoft. NPUsoft may usepacket 101 for bridge learning and optionally for IEEE 802authorization. However, NPUsoft may determine that packet 101 is to bedropped. If, however, a MAC source address for packet 101 is in ART 800,then at 131 such MAC source address is looked up from ART 800.

At 134, control bits may be read from an ART entry associated with a MACsource address looked up at 131. Control bits provide flags responsiveto events, for example as indicated with respect to error conditions forinvoking NPUsoft. If control bits cannot be read, then packet 101 issent to NPUsoft with an error condition, for example error condition135. If control bits are read at 134, then at 136 a determination ismade as to whether the IIF is running NAT. Additionally, at 136, a checkmay be made to determine if the frame has an IP packet 101. If NAT isrunning, then at 137 inbound NAT filtering is done, and at 139 a checkis made as to whether a frame used for packet 101 is a broadcast ormulticast frame. Notably, bridging and routing may be bypassed if NAT isrunning. This is because an ART Index providing a pointer to tableentries is embedded in an xCFH traveling with packet 101. If NAT is notrunning at 136, then bridging and routing is done at 138A, and at 139 acheck is made as to whether a frame used for packet 101 is a broadcastor multicast frame.

If, at 139, either a multicast or broadcast frame is being used, then at141 a check for hardware support for multicast or broadcast framereplication is made responsive to frame type. If multicast or broadcastsupport is found to be lacking at 141, then packet 101 is sent toNPUsoft with an error condition, for example error condition 142. Ifsuch support in hardware exists, then at 143 a check is made todetermine if expansioning or skipping for multicast or broadcast,depending on frame type, includes any disallowed outgoing interface(“OIF”) for a group of listeners. If one or more disallowed OIFs areincluded, then packet 101 is sent to NPUsoft with an error condition,for example error condition 144. Error condition 144 means thatmulticasting or broadcasting is not supported or that packet 101 isinvalid with respect to multicasting or broadcasting. Accordingly,packet 101 may be dropped. If, however, no disallowed OIF is included asdetermined at 143, or no multicast nor broadcast frame is used asdetermined at 139, then at 145 a check is made to determine if the OIFequals the IIF for packet 101. Notably, steps 146 may be moved to arouting and bridging flow, as described below in additional detail. Ifthe IIF and the OIF are equal, then an interface mask, such as interfacemask 803 of FIG. 8, is for an IEEE 802.11 interface and then packet 101is sent to NPUsoft with an error condition, for example error condition147, for processing by NPUsoft or dropping. If, however, the IIF and theOIF are not equal, then at 148 a check for IP protocol type of the OIFis made. At 148, it is determined whether the IP protocol type issupported on the OIF. If the IP protocol type is not supported on theOIF, then packet 101 is sent to NPUsoft with an error condition, forexample error condition 149, for processing by NPUsoft or dropping.

If the IP protocol type is supported on the OIF as determined at 148,then at 151 it is determined whether broadcasting or multicasting isinvoked for the OIF. Notably, determining whether broadcasting ormulticasting of packets being sent out via the OIF is permitted at 151is optional here, and may be done in a routing and bridging flow asdescribed below. If broadcasting or multicasting is not invoked for theOIF, then packet 101 is sent to NPUsoft with an error condition, forexample error condition 152, for processing by NPUsoft or dropping. If,however, broadcasting or multicasting is invoked for the OIF, responsiveto frame type, or if an NPU is in Pass-through Mode B, a check is madeat 153 to determine if packet 101 is a non-IP protocol packet.

Referring to FIG. 2, and in particular FIGS. 2D-1, If packet 101 is of anon-IP protocol type at 153, then packet 101 sent without outboundfiltering, where at 156 packet 101 is composed to produce composedpacket 158 and processed further as previously described. If, however,packet 101 is not of a non-IP protocol type, then at 154 it isdetermined whether the OIF and the IIF are both trusted or both nottrusted, for example by processing a trust bit for each through an XORgate. If both are trusted or both are not trusted, then composition ofpacket 101 takes place as previously described. If, however, one of theIIF or the OIF is trusted and the other one of the OIF and the IIF isnot trusted, then at 155 outbound filtering is done. After outboundfiltering, packet 101 is composed at 156 as previously described.

Alternatively, with reference to FIGS. 2D-2, an alternative composepacket flow 180A is shown. As much of compose packet flow 180A is thesame as that of compose packet flow 180 of FIGS. 2D-1, it is notrepeated. If it is determined at 154 that the OIF and the IIF are notboth trusted or untrusted, then at 201 it is determined whether packet101 is an IP version six (“IPv6”) packet or IPv6 site boundaryenforcement is active. If packet 101 is not an IPv6 packet or IPv6 siteboundary enforcement is not active, then outbound filtering takes placeat 155. Otherwise, at 202 a determination is made as to whether a siteprefix in a destination address for IPv6 packet 101 is the same as theOIF's site prefix. If the two prefixes are not the same, packet 101 issent to NPUsoft with an error condition or dropped at 203. Otherwise,packet 202 is sent to 155 for outbound filtering.

FIG. 3A is a flow diagram of an exemplary embodiment of a bridging androuting flow 138A. Recall from above, an ART entry hash optionally mayhave been done for packet 101 and such an ART index may be travelingwith packet 101 via an xCFH. Thus, for each ART and RT lookup, such anART index may be used. However, it is assumed that an ART entry hash forpacket 101 has not optionally been done.

Bridging and routing flow 138A is initiated at 301. At 302, adetermination is made as to whether a MAC destination address of packet101 matches an interface, such as IIF or OIF.

If a MAC destination address matches an interface for routing of packet101, then at 303 a determination is made as to whether packet 101contains a routable IP protocol, such as whether packet 101 is an IPv4or IPv6 packet. If packet 101 does not contain a routable IP protocol,then packet 101 is sent to NPUsoft with an error condition, for exampleerror condition 304, for processing by NPUsoft or dropping. If, however,packet 101 contains a routable IP protocol, such as IP version 4(“IPv4”) or IP version 6 (“IPv6”), then at 306 a determination is madeas to whether routing is supported in hardware. If routing is notsupported in hardware, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 307, for routing by NPUsoft asdescribed below for example with respect to one or more ofinstantiations 314, 316 and 318.

At 314, a network layer (“layer-3”) validity check is done, and an xCFHis marked to indicate this check has been done. If packet 101 is foundto be invalid with respect to a layer-3 validity check at 314, thenpacket 101 is sent to NPUsoft with an error condition, for example errorcondition 315, for processing by NPUsoft or dropping.

If network layer validity is established, then at 316, IP options arechecked, and an xCFH of packet 101 is marked to indicate that IP optionshave been checked. If IP options are unsupported or invalid, then packet101 is sent to NPUsoft with an error condition, for example errorcondition 317, for processing by NPUsoft or dropping. If, however, allIP options are supported and valid, at 318 RT 900 is accessed lookingfor a match of an IP destination address for packet 101 as an entry inRT 900. If no match is found, then packet 101 is sent to NPUsoft with anerror condition, for example error condition 319, for processing byNPUsoft, such as with a general routing table (“GRT”) lookup. If,however, an IP Destination Address 901 is found in RT 900 matching an IPdestination address of packet 101, an ART Index 601 stored in RT 900 inassociation with such IP Destination Address 901 is added to an xCFH ofpacket 101, and then routing and bridging flow 138A returns to addresstranslation flow 100 at 399. Additionally, the TTL in the xCFH may bedecremented. Notably, it should be appreciated that RT 900 is a compactrouting table as compared with conventional routing tables. This compactnature of RT 900 facilitates using exact-match comparison of thepacket's IP destination address against all the entries in RT 900,instead of a “longest” match (i.e., a longest-match algorithm forfinding the GRT entry with the greatest number of most-significant bits(“MSBs”) in common with the packet's IP destination address).Furthermore, if an exact match is found in RT 900, then all informationfor a next hop header is available. Accordingly, a next hop header maybe built without having to resort to a GRT lookup. Alternatively, a MACdestination address search may be done in ART 800 for an exact match,and if an exact match is not found, the MAC destination address isstored in an xCFH of packet 101 and in RT 900.

If, however, at 302 a MAC destination address does not match aninterface for bridging of packet 101, then at 305 a determination ismade as to whether IP multicast routing is invoked and whether packet101 is an IP multicast packet and not a broadcast packet. If both IPmulticast routing is invoked and packet 101 is a multicast packet, thenat 308 a determination is made as to whether an IP Source Address 902 inRT 900 matches an IP source address of packet 101. If no match of the IPsource address is found, then packet 101 is sent to NPUsoft with anerror condition, for example error condition 313, for processing byNPUsoft or dropping. If a match of the IP source address is found, thenpacket 101 is processed further as previously described starting at 314.

If, however, at 305, either IP multicast routing is not invoked orpacket 101 is not a multicast packet, then checks for broadcasting ofpacket 101 are done beginning at 309 with a determination of whetherbridging is supported in hardware. If bridging is not supported inhardware, then packet 101 is sent to NPUsoft with an error condition,for example error condition 310, for processing by NPUsoft as describedbelow for example with respect to instantiation 311.

If bridging is supported in hardware, then at 311 ART 800 is accessedlooking for a match of a MAC destination address for packet 101 as anentry in ART 800. If no match is found, then packet 101 is sent toNPUsoft with an error condition, for example error condition 312, forprocessing or dropping by NPUsoft. If, however, a MAC DestinationAddress 801 is found in ART 800 matching a MAC destination address ofpacket 101, an ART Index 601 stored in ART 800 in association with suchMAC Destination Address 801 is added to an xCFH of packet 101, and thenrouting and bridging flow 138A returns to address translation flow 100at 399.

FIG. 3B is a flow diagram of an exemplary embodiment of a bridging androuting flow 138B. Much of bridging and routing flow 138B is the same aspreviously described bridging and routing flow 138A, and thus is notrepeated. At 301 bridging and routing flow is initiated. At 334, alayer-2 validity check is done, and an xCFH of a packet is marked toindicate such check was done. Layer-2 validity checks may include:whether a MAC source address is a non-unicast source address; whetherthere is a length error in the MAC frame; and whether the cracker reportindicates an error in the xCFH. If layer-2 for such a packet, forexample, packet 101, is invalid, then an error condition 335 is sent toNPUsoft. Notably, operation 334 need not be done here, if previouslydone as part of NPU Mode A flow 140. If layer-2 for packet 101 is valid,then operation 302 for a MAC address match is done.

If there is no match at 302, at 324 a check as to whether packet 101 isa unicast or broadcast packet is made. If packet 101 is a unicast orbroadcast packet, then previously described operations 309 and 311 maybe done. Otherwise, at 325 it is determined whether this multicastframe, by process of elimination, has an IP packet. If there is no IPpacket, then previously described operations 309 and 311 may be done.Otherwise, at 326 it is determined whether packet 101 is a valid IPmulticast frame and packet. If packet 101 is found not to be valid at326, then an error condition 329 is sent to NPUsoft. Otherwise, at 327it is determined if multicast routing is active. If not active, thenpreviously described operations 309 and 311 may be done. If multicastrouting is active, then at 328 operation 308 is done with one addition,namely, storing a reverse path forwarding interface (“RFPi”). An RFPi isan interface on which a packet form a source of the packet would beexpected for arrival, for example by looking up a source's IP address ina routing table and seeing if the interface on which the packet arrivedwas indeed the same interface that the router would use if it had tosend a packet in the direction of the source of the packet that arrived.At 314, layer-3 validity is checked as previously described.

If there is no MAC address match at 302, operations 303, 306 and 314 maybe done. From operation 314, an optional check to determine if packet101 has any IP options may be made at 334. If there are no IP options,then operation 318 is done as previously described. If there are one ormore IP options, then operations 316 and 318 may be done as previouslydescribed.

Notably, all broadcast frames for flow 138B are processed on thebridging path. Furthermore, ART entries may be setup such that NPUsoftgets a copy of each broadcast frame.

FIG. 3C is a flow diagram of an exemplary embodiment of a bridging androuting flow 138C. Much of bridging and routing flow 138C is the same aspreviously described bridging and routing flows 138A and 138B, and thusis not repeated. Routing and bridging flow 138C is initiated at 301. At354, layer-2 and layer-3 validity checks are done. If layer-2 or layer-3is invalid, an error condition 355 is sent to NPUsoft. Otherwise, at 344it is determined whether the frame is a broadcast frame. If the framefor packet 101 is a broadcast frame, then at 347 it is determinedwhether the Operating System (“OS”) is to process packet 101. If the OSis not to process packet 101, an error condition 349 is sent to NPUsoft.If, however, the OS is to process packet 101, then packet 101 isforwarded to an IP stack of the host device.

If, however, at 344 it is determined that a frame for packet 101 is nota broadcast frame, then at 345 it is determined whether the frame is amulticast frame. If it is determined that the frame is a multicastframe, then at 348 it is determined whether the OS is to process thepacket. If the OS is to process packet 101, then packet 101 is forwardedto an IP stack of the host device. If the OS is not to process packet101, then previously described operation 327 is done, except that ifmulticast routing is not active an error condition 351 is sent toNPUsoft. If multicast routing is active, then operation 308 is done. Ifa source address is found from operation 308, then at 356 it isdetermined whether unicast routing is supported in hardware, such as anNPU.

However, if at 345 it is determined that a frame for packet 101 is not amulticast frame, then at 346 it is determined whether a MAC destinationaddress for the frame matches a MAC address of an IIF for packet 101. Ifthere is no address match, then previously described operations 309 and311 may be done. If there is an address match, then at 352 it isdetermined whether a protocol for packet 101 is routable on such an IIF.If this protocol is not a routable protocol for this IIF, then an errorcondition 353 is sent to NPUsoft. If this protocol is a routableprotocol for this IIF, then at 356 it is determined whether unicastrouting is supported in hardware, such as an NPU.

From 356, if it is determined that unicast routing is not supported inhardware, then an error condition 354 is sent to NPUsoft. Otherwise,previously described operations 316 and 318 may be done.

As mentioned above with reference to FIG. 2C, operations 146 could beincorporated into bridging and routing flow 138C, where operations 344and 345 in combination provide operation 139 of FIG. 2C. Additionally,instead of having OS process packet 101, operations 141 and 143 may bedone.

FIG. 4A is a flow diagram of an exemplary embodiment of an inbound NATfiltering flow 137. Inbound NAT filtering flow 137 is initiated at 401.At 402, a check for hardware support for NAT is made. If no such supportis available, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 403, for processing by NPUsoft asdescribed below. If, however, NAT processing is supported in hardware,then at 404 a layer-3 validity check is done. Notably, if layer-2validity checking is not done as part of NPU mode A flow 140, thenlayer-2 validity is also checked at 404. For clarity, it is assumed thatonly layer-3 validity is checked at 404, though both layer-2 and layer-3validity may be checked at 404 where both need to be valid to pass orwhere if one is invalid, an error condition indicating which or both oflayers-2 and -3 is invalid is sent. If the layer-3 validity check comesback with an invalid condition, then packet 101 is sent to NPUsoft withan error condition, for example error condition 405, for processing ordropping by NPUsoft as an invalid packet. If layer-3 is valid, then at406 an IP options check is done. If one or more IP options areunsupported or invalid, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 407, for processing by NPUsoft ashaving one or more unsupported or invalid IP options. If all IP optionsare supported and valid, then at 408 a check is made to determine ifpacket 101 is an IP fragment, namely, from a fragmented packet. Ifpacket 101 is a fragment, then packet 101 is sent to NPUsoft with anerror condition, for example error condition 409, for processing byNPUsoft. Notably, NPUsoft may employ “fragment absorption,” wherereceived fragment packets are all collected and reassembled, wherepossible, before being forwarded, as described in below.

If packet 101 is not a fragment, then it is determined what type ofpacket it is for further processing. If packet 101 is a TCP packet asfound at 410, then at 411 it is determined if packet 101 is for a newconnection. For example, if TCP state has synchronize (“SYN”) equal toone, then this is for a new connection. If packet 101 is for a newconnection, then packet 101 is sent to NPUsoft with an error condition,for example error condition 412, for processing by NPUsoft. Thus,NPUsoft will use information from packet 101 to build an entry in CT 600and NT 700 prior to returning packet 101 to address translation flow100.

If packet 101 is not for a new connection, or if at 410 packet 101 isfound not to be a TCP packet but at 413 is found to be a UDP packet,then at 414, NT 700 is accessed to lookup an inbound five-tuple forpacket 101. A hash of a five-tuple of packet 101 is done prior to thislookup, for example during building entries in CT 600 and in NT 700 forthis packet 101 or a previous packet 101 for the same connection, a hashof a five-tuple may be stored in CT 600 and in NT 700 in associationwith such a five-tuple for cross-linking tables CT 600 and NT 700.Recall, packet 101 may be a remote or local inbound packet to the NPU.If the five-tuple for packet 101 is not in NT 700, then packet 101 issent to NPUsoft with an error condition, for example error condition415, for processing to build an entry in CT 600 and NT 700 prior toreturning packet 101 to address translation flow 100, or for dropping byNPUsoft. If, however, the five-tuple for packet 101 is in NT 700, thenat 414 a CT Index hashed from such a five-tuple of packet 101 is storedin an xCFH of packet 101. Processing of packet 101 processing proceedsat 416. At 416, an NT Index is obtained from CT 600 in association witha five-tuple entry matching that of packet 101 is stored in an xCFH ofpacket 101. This lookup in CT 600 is done with the recently obtained CTIndex added to an xCFH of packet 101. As mentioned above, such an NTIndex and a CT Index may be from a hash done in hardware or with NPUsoftwhen building a respective entry in NT 700 and CT 600 for a prior packetof this connection for packet 101. Furthermore, it should be appreciatedthat for NAT, translation is done by a gateway device between a remotecomputer and a local computer. Thus, to obtain an address and portnumber of a local computer for NAT, CT 600 is used, and to obtain anaddress and port number of a gateway device, NT 700 is used.

If packet 101 is not found to be a UDP packet at 413 but is found to bea GRE packet at 417, then at 418, NT 700 is accessed to lookup aninbound “five-tuple” for packet 101. By “five-tuple,” is meant toinclude a GRE Call ID split into two data spaces turning a four-tupleinto a pseudo-five-tuple. Thus, a five-tuple of packet 101 is used forthis lookup. Thus, a GRE Call ID is used in part for this lookup.Recall, packet 101 may be a remote or local inbound packet to the NPU.If the five-tuple for packet 101 is not in NT 700, then packet 101 issent to NPUsoft with an error condition, for example error condition419, for processing or dropping by NPUsoft. If, however, the five-tuplefor packet 101 is in NT 700, then at 418 a CT Index hashed from such afive-tuple is obtained from NT 700 and is stored in an xCFH of packet101. Processing of packet 101 processing proceeds at 416. At 416, an NTIndex is obtained from CT 600 in association with a five-tuple entrymatching that of packet 101 is stored in an xCFH of packet 101. Thislookup in CT 600 may be done using the recently obtained CT Index storedin an xCFH of packet 101. As mentioned above, such an NT Index and a CTIndex may be from a hash done in hardware or with NPUsoft when buildinga respective entry in NT 700 and CT 600 for a prior packet of thisconnection.

If packet 101 is not found to be a GRE packet at 417 but is found to bean IPSec packet at 420, then at 421, NT 700 is accessed to lookup aninbound “five-tuple” for packet 101. By “five-tuple,” is meant toinclude an SPI split into two data spaces turning a four-tuple into apseudo-five-tuple. A five-tuple of packet 101 is used for this lookup.Thus, a SPI is used in part for this lookup. Recall, packet 101 may be aremote or local inbound packet to the NPU. If the five-tuple for packet101 is not in NT 700, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 422, for processing to build anentry in CT 600 and NT 700 prior to returning packet 101 to addresstranslation flow 100, or for dropping by NPUsoft. If, however, thefive-tuple for packet 101 is in NT 700, then at 421 a CT Index hashedfrom such a five-tuple and looked up in NT 700 is stored in an xCFH ofpacket 101. Processing of packet 101 processing proceeds at 416. At 416,an NT Index is obtained from CT 600 in association with a five-tupleentry matching that of packet 101 is stored in an xCFH of packet 101.This lookup in CT 600 may be done using the recently obtained CT Indexstored in an xCFH of packet 101. As mentioned above, such an NT Indexand a CT Index may be from a hash done in hardware or with NPUsoft whenbuilding a respective entry in NT 700 and CT 600 for a prior packet ofthis connection.

If packet 101 is not found to be an IPSec packet at 420 or an InternetControl Message Protocol (ICMP) packet at 423, then packet 101 is sentto NPUsoft with an error condition, for example error condition 424, forprocessing to build an entry in CT 600 and NT 700 prior to returningpacket 101 to address translation flow 100, or for dropping by NPUsoft.If packet 101 is not found to be an IPSec packet at 420 but is found tobe an ICMP packet at 423, then at 425 a check is made to determine ifpacket 101 is on a list of supported ICMP packet types stored in memory,such as ICMP version 4 (“ICMPv4”) and ICMP version 6 (“ICMPv6”). Ifpacket 101 type is not on the list of supported ICMP packet types, thenpacket 101 is sent to NPUsoft with an error condition, for example errorcondition 426, for processing or dropping by NPUsoft. If packet 101 typeis on the list of supported ICMP packet types, then processing of packet101 proceeds at 427.

At 427, from 425 or from 416, an ART Index is stored in an xCFH ofpacket 101. The Art Index is obtained from CT 600 or NT 700, using a CTIndex or NT Index, respectively, from an xCFH of packet 101 or isobtained from a five-tuple entry matching that of packet 101 in one ofCT 600 or NT 700 for ICMP packets. At 428, inbound NAT filtering flow137 returns to address translation flow 100. Notably, a hash forgenerating an ART Index may be of an entry or portion thereof in ART800, and such a hash may be done when building an entry for packet 101or a prior packet 101 for the same connection in ART 800.

Notably, a hash function computes a hash value based on a packet'sfive-tuple information, and this hash value is used as an index to NT700. A hash function is the same for creating NT and CT indices.However, input to the hash function is not the same for creating CTindex as it is for creating an NT index. In other words, an NT indexuses public address information as part of the hash function input, anda CT index uses local address information as part of the hash functioninput instead of the public address information. However, a CT index maybe created from local address information and stored in place of an NTindex in CT 600 when NAT is not active.

FIG. 4B is a flow diagram of an exemplary alternative embodiment of aportion of NAT filtering flow 137 of FIG. 4A. Rather than obtaining andstoring a CT index at 414, 418 and 421 as in FIG. 4B, no CT index isobtained and stored at corresponding blocks 444, 448 and 441. Rather, at428, CT, NT and ART indices are obtained and stored in CFHs of packet101. Additionally, “Time To Live” (“TTL”) in CFH is decremented at 432.Another difference from the flow of FIG. 4A, is that rather thanobtaining and storing an ART index for an ICMP packet on the list at425, an error or state condition is sent at 431 to NPUsoft. As theremainder of FIGS. 4A and 4B are the same, the description is notrepeated.

FIG. 5A is a flow diagram of an exemplary embodiment of an outboundfiltering flow 155. Much of outbound filtering flow 155 is similar toinbound NAT filtering flow 137, and thus is not repeated here. Outboundfiltering flow 155 is initiated at 501. At 502, a check for hardwaresupport for firewall processing is made. If no such support isavailable, then packet 101 is sent to NPUsoft with an error condition,for example error condition 503, for processing by NPUsoft as describedbelow.

If, however, firewall processing is supported in hardware, then at 504 acheck is made to determine if packet 101 is an IP fragment, namely, froma fragmented packet. If packet 101 is a fragment, then packet 101 issent to NPUsoft with an error condition, for example error condition505, for processing by NPUsoft. Notably, NPUsoft may employ “fragmentabsorption,” where received fragment packets are all collected andreassembled, where possible, before being forwarded, as described below.

If, however, packet 101 is not an IP fragment, then at 529 a check ismade to determine if the IIF for packet 101 was running NAT. If the IIFwas running NAT, then at 516 an NT Index is obtained from an xCFH ofpacket 101 to find a five-tuple in NT 700. Alternatively, a CT Index maybe obtained from an xCFH of packet 101 to obtain a five-tuple from CT600, if stored therein. After which, processing of packet 101 continuesat 531, as described below.

If, however, at 529, the IIF of packet 101 was not running NAT, then at506 a layer-3 validity check is done. Notably, if layer-2 validitychecking is not done as part of NPU mode A flow 140, then layer-2validity is also checked at 506. For clarity, it is assumed that onlylayer-3 validity is checked at 506, though both layer-2 and layer-3validity may be checked at 506 where both need to be valid to pass orwhere if one is invalid, an error condition indicating which or both oflayers-2 and -3 is invalid is sent. If the layer-3 validity check comesback with an invalid condition, then packet 101 is sent to NPUsoft withan error condition, for example error condition 507, for processing ordropping by NPUsoft as an invalid packet. If layer-3 is valid, then at508 an IP options check is done. If one or more IP options areunsupported or invalid, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 509, for processing by NPUsoft ashaving one or more unsupported or invalid IP options.

If all IP options are supported and valid at 508, then a check is madeat 510 to determine if packet 101 is a TCP packet. If packet 101 isdetermined to be a TCP packet, then at 511 it is determined if packet101 is for a new connection (i.e., SYN equal to 1). If packet 101 is fora new TCP connection or new “handshake,” then packet 101 is sent toNPUsoft with an error condition, for example error condition 512, forprocessing to build an entry in CT 600 prior to returning packet 101 toaddress translation flow 100. If packet 101 is not for a new TCPconnection, or if at 510 packet 101 is found not to be a TCP packet butat 513 is found to be a UDP packet, then at 514 a check for an NT Index,such as from a prior hash of a five-tuple for packet 101 or a priorpacket for the same connection, is made by doing a CT 600 lookup for anoutbound five-tuple matching the five-tuple of packet 101. Recall,packet 101 may be a remote or local outbound packet to the NPU. If thefive-tuple for packet 101 is not in CT 600, then packet 101 is sent toNPUsoft with an error condition, for example error condition 539, forprocessing to build an entry in CT 600 prior to returning packet 101 toaddress translation flow 100, or for dropping by NPUsoft. If, however,the five-tuple for packet 101 is in CT 600, then at 514 an NT Indexhashed from such a five-tuple is stored in an xCFH of packet 101,provided such an NT Index is present in CT 600. Notably, if afirewalling-only mode is being used, namely, a mode without any NAT,then no NT index will be present in CT 600. Processing of packet 101processing proceeds at 531.

At 531, a check is made to determine or confirm (as it may havepreviously been determined at 510 that packet 101 is a TCP packet) asapplicable, if packet 101 is a TCP packet and if packet 101 has a TCPstate error. A TCP error results when state of a packet does not matchthe state of a connection associated with the packet. Notably, the checkat 531 is inapplicable to UDP packets as they just flow through 531.Furthermore, TCP state tracking as described below, or a subset thereof,may be used for TCP state error check 513. If packet 101 is a TCP packetand has a TCP state error, then packet 101 is sent to NPUsoft with anerror condition, for example error condition 515, for processing ordropping by NPUsoft. If, however, at 531 either packet 101 is not a TCPpacket or does not have a TCP state error, then processing of packet 101proceeds at 532, as described below.

If packet 101 is not found to be a UDP packet at 513 but is found to bea GRE packet at 517, then at 518, CT 600 is accessed with a five-tuplefrom packet 101 to lookup an outbound five-tuple for packet 101. Recall,packet 101 may be a remote or local outbound packet to the NPU, and partof the five-tuple is a GRE Call ID. If the five-tuple for packet 101 isnot in CT 600, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 519, for processing to build anentry in CT 600 prior to returning packet 101 to address translationflow 100, or for dropping by NPUsoft. If, however, the five-tuple forpacket 101 is in CT 600, then at 518 an NT Index, hashed from such afive-tuple, is obtained from CT 600 if present and is stored in an xCFHof packet 101. Processing of packet 101 proceeds at 532, as describedbelow.

If packet 101 is not found to be a GRE packet at 517 but is found to bean IPSec packet at 520, then at 521, CT 600 is accessed with afive-tuple of packet 101 to lookup an outbound five-tuple for packet101. Recall, packet 101 may be a remote or local outbound packet to theNPU, part of the five-tuple is an SPI. If the five-tuple for packet 101is not in CT 600, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 522, for processing to build anentry in CT 600 prior to returning packet 101 to address translationflow 100, or for dropping by NPUsoft. If, however, the five-tuple forpacket 101 is in CT 600, then at 521 an NT Index, hashed from such afive-tuple, is obtained from CT 600 if present and is stored in an xCFHof packet 101. Processing of packet 101 proceeds at 532, as describedbelow.

At 532, a check is made to determine if the OIF of packet 101 is runningNAT. If the OIF of packet 101 is not running NAT, at 528 outboundfiltering flow 155 returns to address translation flow 100. If, however,the OIF of packet 101 is running NAT, then at 527 an entry in NT 700 isaccessed using an NT Index obtained from an xCFH of packet 101. Afterwhich, at 528 outbound filtering flow 155 returns to address translationflow 100.

If packet 101 is not found to be an IPSec packet at 520 or an ICMPpacket at 523, then packet 101 is sent to NPUsoft with an errorcondition, for example error condition 524, for processing or droppingby NPUsoft. If packet 101 is not found to be an IPSec packet at 520 butis found to be an ICMP packet at 523, then at 525 a check is made todetermine if packet 101 is on a list of supported ICMP packet typesstored in memory, such as ICMPv4 and ICMPv6. If packet 101 type is noton the list of supported ICMP packet types, then packet 101 is sent, forexample to NPUsoft, with an error condition, for example error condition526, for allowing such a packet to pass through or to be dropped.Notably, if an ICMP packet type is not on the list, the default may beto drop the packet or to allow the packet to pass through the NPU, whichoutcome may be dependent on the type of ICMP packet. If packet 101 typeis on the list of supported ICMP packet types, at 528 outbound filteringflow 155 returns to address translation flow 100.

Notably, by using indices stored in an xCFH of a packet, information ishanded down from inbound filtering to outbound filtering. This isparticularly useful when NAT is being used, where outbound filtering issubstantially simplified by having access to an index to NT 700.Furthermore, it should be appreciated that ordering of the steps may bealtered. For example, a check for an ICMP packet type at 423 or 523 maybe done prior to checking for any other packet type. However, as NATinbound and outbound filtering is not supported for ICMP error packetpayloads, doing ICMP toward the end makes sense.

FIG. 5B is a flow diagram of an exemplary embodiment of an outboundfiltering flow 155A. Much of outbound filtering flow 155A is similar tooutbound filtering flow 155, and thus much not repeated here. Outboundfiltering is initiated at 501. At 502, it is determined if firewallprocessing is supported in hardware. At operation 529, it is determinedwhether an IIF is running NAT. If the IIF is not running NAT, thenoperations 506, 508 and 504 are done as previously described. Packetprocessing operations for non-NAT inbound filtering are the same as foroutbound filter flow 155, except that output from operation 514 for amatch is processed differently, namely, if a match is found in a CT 600at 514, then at 581 it is determined whether packet 101 is a TCP packet.Additional details are provided below for post operation 581 processing.

If, at 529, an IIF is running NAT, then at 566 CT and NT indices areobtained from CFHs for packet 101. At 567, packet 101 is translated froma local or private address to a gateway or public address usinginformation obtained from CT 600 and NT 700 lookups using CT and NTindices to obtain local, public and remote address information. At 581,it is determined whether packet 101 is a TCP packet.

If, at 581, packet 101 is found not to be a TCP packet, then at 532 itis determined if an OIF is running NAT. If the OIF is running NAT, thenat 586 a five-tuple is looked up using an NT index from a CFH of packet101 to do the NT 700 lookup. A CT index is obtained from NT 700 duringthe NT index lookup and stored in a CFH for packet 101, if not alreadypresent in the CFH for packet 101. At 587, packet 101 is translated froma local or private address to a gateway or public address usinginformation obtained from CT 600 and NT 700 lookups using CT and NTindices to obtain local, public and remote address information. Afterwhich, outbound filtering flow 155A returns at 528. Additionally, if theOIF is not running NAT, then outbound filtering flow 155A returns at528.

If, however, at 581 packet 101 is found to be a TCP packet, then at 582TCP options are checked. If TCP options are not okay, an error condition585 is sent to NPUsoft. If TCP options are okay, then at 583 a check ismade for a TCP state error. If there is a TCP state error, an errorcondition 584 is sent to NPUsoft. If there is no TCP state error, then acheck for the OIF running NAT at 532 is made as previously described.

FIG. 10 is a state transition diagram of an exemplary embodiment of astate tracking flow 531 for tracking a packet. State tracking flow isdescribed in terms of well-known code bits for TCP state transitions,such as Synchronize (“SYN”), Acknowledge (“ACK”), Reset (“RST”),Finished (“FIN”), and Received (“RCVD”), among others. State trackingflow 531 may be implemented in hardware or software, including acombination thereof, in the form of a state machine. State tracking flow531 starts in a CLOSED state 998, from which a passive open causes atransition to LISTEN state 903 or from which a sent SYN cause atransition to SYN-SENT state 904. From LISTEN state 903, transitioningto CLOSED state 998 occurs responsive to an age out or close condition.Notably, an RST received (not shown) within a valid receive window orsent out within a valid send window causes a transition to a CLOSEDstate 998 or 999.

From LISTEN state 903, transitioning to SYN-RCVD state 905 occursresponsive to a received SYN. From LISTEN state 903, transitioning toSYN-SENT state 904 occurs responsive to a sent SYN.

From SYN-RCVD state 905, transitioning to SYN-RCVD-SYN-SENT state 906occurs responsive to a sent SYN, and transitioning toSYN-RCVD-SYN-ACK-SENT state 912 occurs responsive to a sent SYN-ACK.

From SYN-SENT state 904, transitioning to SYN-RCVD-SYN-SENT state 906occurs responsive to a received SYN, and transitioning toSYN-SENT-SYN-ACK-RCVD state 913 occurs responsive to a received SYN-ACK.

From SYN-RCVD-SYN-SENT state 906, transitioning to SYN-RCVD-SYN-SENT1state 907 occurs responsive to a sent SYN-ACK, and transitioning toSYN-RCVD-SYN-SENT2 state 908 occurs responsive to a received SYN-ACK.

From SYN-RCVD-SYN-SENT1 state 907, transitioning to a connectionESTABLISHED state 909 occurs responsive to a received SYN-ACK. FromSYN-RCVD-SYN-SENT2 state 908, transitioning to ESTABLISHED state 909occurs responsive to a sent SYN-ACK.

From SYN-RCVD-SYN-ACK-SENT state 912, transitioning to ESTABLISHED state909 occurs responsive to a received ACK of a SYN. FromSYN-SENT-SYN-ACK-RCVD state 913, transitioning to ESTABLISHED state 909occurs responsive to a sent ACK of a SYN.

From ESTABLISHED state 909, SYN-RCVD-SYN-ACK-SENT state 912 orSYN-SENT-SYN-ACK-RCVD state 913, transitioning to FIN-WAIT1 state 914occurs responsive to a sent FIN. From ESTABLISHED state 909,SYN-RCVD-SYN-ACK-SENT state 912 or SYN-SENT-SYN-ACK-RCVD state 913,transitioning to CLOSE-WAIT-FIN state 915 occurs responsive to areceived FIN.

From FIN-WAIT1 state 914, transitioning to: CLOSING-FIN state 917 occursresponsive to a received FIN; FIN-WAIT2 state 916 occurs responsive to areceived ACK of a FIN, and transitioning to FIN-WAIT2-FIN state 921occurs responsive to a received FIN and a received ACK of the FIN in thesame packet.

From CLOSE-WAIT-FIN state 915, transitioning to: CLOSING-FIN state 917occurs responsive to a sent FIN; CLOSE-WAIT state 918 occurs responsiveto a sent ACK of a FIN, and transitioning to LAST-ACK state 923 occursresponsive to a sent FIN and a sent ACK of the FIN in the same packet.

From FIN-WAIT2 state 916, transitioning to FIN-WAIT2-FIN state 921occurs responsive to a received FIN. From CLOSE-WAIT state 918,transitioning to LAST-ACK state 923 occurs responsive to a sent FIN.

From CLOSING-FIN state 917, transitioning to FIN-WAIT2-FIN state 921occurs responsive to a received ACK of a FIN, and transitioning toCLOSING state 922 occurs responsive to a sent ACK of a FIN.

From CLOSING state 922, transitioning to TIME-WAIT state 924 occursresponsive to a received ACK of a FIN. From FIN-WAIT2-FIN state 921,transitioning to TIME-WAIT state 924 occurs responsive to a sent ACK ofa FIN.

From LAST-ACK state 923, transitioning to CLOSED state 999 occursresponsive to a received ACK of a FIN. From TIME-WAIT state 924,transitioning to CLOSED state 999 occurs responsive to a timed outcondition.

For a hardware and software embodiment, CLOSED states 998 and 999 arehardware and software states. States within dashed-box 997 are softwarestates, and states with dashed-box 996 are hardware states.

Referring to FIG. 12A, there is shown a block diagram of an exemplaryembodiment of a NPU 1070. NPU 1070 comprises MAC interface (“MI”) 1010,sequence processor 1020, address translator 1030, host MAC 1040, andfront end 1050. NPU 1070 micro architecture uses a hardwired pipelinewithout a central processing unit (“CPU”) core. A network driverprogram, including a software or data portion of address translationflow 100, may be stored in system memory. Such a network driver programand NPU 1070 communicate with one another using commands via pushbuffers (“PBs”), namely, a command buffer going from software to NPU orNPU to software, as described in additional detail below.

Input from MAC layer 1097 and output to MAC layer or host bus 1098 maybe in a form compatible with one or more of Ethernet 10/100/1000mega-bits-per-second (“Mbps) (“IEEE 802.3”) for local area network(“LAN”) connectivity, Home Phoneline Network Alliance (“HomePNA” or“HPNA”), wireless local area network (“WLAN”) (“IEEE 802.11”), and adigital signal processor (“DSP”) MAC layer, among others. Though apersonal computer workstation embodiment is described herein, it shouldbe understood that NPU 1070 may be used in other known devices fornetwork connectivity, including, but not limited to, routers, switches,gateways, and the like. Furthermore, a host or local bus may be a FastPeripheral Component Interconnect (“FPCI”) bus; however, other buses,whether directly accessed or coupled to a host bus, include, but are notlimited to, Peripheral Component Interconnect (“PCI”), 3GIO, VideoElectronic Standards Association (“VESA), VersaModule Eurocard (“VME”),Vestigial Side Band (“VSB”), Accelerated Graphics Port (“AGP),Intelligent I/O (“I2O”), Small Computer System Interface (“SCSI”), FiberChannel, Universal Serial Bus (“USB”), IEEE 1394 (sometimes referred toas “Firewire,” “Link” and “Lynx”), Personal Computer Memory CardInternational Association (“PCMCIA”), and the like.

NPU 1070 receives a frame input from MAC layer 1097. This frame flowsthrough NPU 1070's pipeline, starting with MAC interface 1010. MACinterface 1010 receives one or more frame inputs 1011. MAC interface1010 is coupled to front end 1050 for access to memory 1052 via memoryarbiter 1051. Notably, memory 1052 may be memory local to NPU 1070 orsystem memory of a host system. Frame inputs 1011 are processed in partby placing them into staging buffers in cache memory 1013. If capacityof staging buffers is exceeded or downstream NPU 1070 pipeline isblocked, spill over frames are queued in memory 1052.

Frame inputs 1011 have a respective CFH added to the beginning of aframe to indicate its type and input MAC index. Notably, handling offrame inputs 1011 can depend at least in part on frame type. Forexample, WLAN management frames and like frame types have their CFHmarked for being passed directly to Host MAC 1040, while other framesare passed to sequence processor 1020.

For purposes of clarity of explanation, processing of one frame throughNPU 1070 pipeline will be described, though it should be understood thatmultiple frames may be pipeline-processed through NPU 1070. Lookuptables in memory 1052 may include state tables 600, 700, 800, and 900,as described above, as well as a list of supported ICMP types 1071.Supported ICMP types may be loaded from a network driver program.Sequence processor 1020 on an inbound side may include a decapsulationmodule 1021, a validation module 1022 and a security module 1023A.

Address translator 1030 provides NAT for converting public IP addressesto private IP addresses. However, if a packet is from a LAN, thenconventionally no address translation is done. Rather, NAT is done for apacket communicated over a wide area network (“WAN”), including, but notlimited to, a portion of the Internet. Security modules for incoming andoutgoing packets 1023A and 1023B, respectively, may be instantiated insequence processor 1020. For example, IPSec may be used with NAT asdescribe in a co-pending U.S. patent application entitled “METHOD ANDAPPARATUS FOR SECURITY PROTOCOL AND ADDRESS TRANSLATION INTEGRATION” byThomas A. Maufer, Sameer Nanda, and Paul J. Sidenblad, filed Jun. 13,2002, application Ser. No. 10/172,352, which is incorporated byreference as though fully set forth herein.

Bridging and routing module 1032 includes multicast expansioning. Aftera lookup in CT 600 or NT 700, a routing table lookup from memory 1052 isdone for an Address Resolution Protocol (“ARP”) table 702 to convert anIP address for a packet into a physical address. Moreover, if more thanone output MAC address is specified, then multicast expansioning isdone. Notably, at this point a packet may be output for use by a hostcomputer user. Routing from address translator 1030 for a packet may befor sending such a packet.

In addition to NAT, firewalling may be done with NAT output, firewallscreening and flow classification module 1033, namely, review headerfields, classify packets in lookup tables in cache memory, mark CFH withper-MAC output first-in first-out (“FIFO”) index, new priority, and anew ToS, among other previously described events.

Packets processed on an outbound side of sequence processor 1020 may beprocessed through one or more of fragment module 1027, security module1023B and encapsulation module 1028. One or more packets are provided asmultiple frames for each packet from sequence processor 1020 to MACinterface 1010 as frame output 1012. MAC interface 1010 writes a framefrom sequence processor 1020 to one or more staging buffers in cachememory 1013. If MAC interface 1010 does not have priority to do suchwriting to cache memory 1013 due to flow scheduling, such frame isspilled over to memory 1052. Frame output 1012, once scheduled, isoutput-to-output MAC layer or host bus 1098.

NPU 1070 may form a portion of an intelligent network interface(sometimes referred to as a “network interface card” or “NIC”), and thusNPU 1070 may be used to do computationally intensive network stackoperations rather than using a host CPU. This frees up a host CPU forother activities. Additionally, a privileged and command engine 1053 maybe included with FE 1050 and coupled to a host via an input/output(“I/O”) interface 1099 for direct access to and from NPU 1070 by a hostsystem. Other details regarding NPU 1070 may be found in the co-pendingpatent application entitled “METHOD AND APPARATUS FOR PERFORMING NETWORKPROCESSING FUNCTIONS” by Robert A. Alfieri, Gary D. Hicok, Paul J.Sidenblad, filed Dec. 13, 2002, application Ser. No. 10/319,791,assigned to the same assignee as this patent application, which isincorporated by reference as though fully set forth herein.

Notably, memory 1013 may be coupled to frame input 1011 for bufferingpackets for a respective connection. For example, in Voice-Over IP(“VOIP”), UDP is used to send many packets at a time. VOIP is a lowlatency application where packets are order specific. Accordingly,memory 1013 can buffer overflow packets, and increment counter 1043 viacount signal 1044. As packets are processed out of memory 1013, countsignal 1044 is used to decrement counter 1043. When counter 1043 is downto zero, as indicated by total signal 1045, then all packets in memory1013 for a connection have been sent out of memory 1013. Notably,multiple counts may be maintained for supporting multiple connections.

Referring to FIG. 12B, there is shown a flow diagram of an exemplaryembodiment of a packet processing flow 1080 for processing bursts ofpackets. A VOIP session may generate an exemplary burst of UDP packets.With continued reference to FIG. 12B and renewed reference to FIGS. 6and 12A, processing of packets when burst of packets are received isfurther described.

Packets 1060 are serially received at 1061 to an NPU, such as NPU 1070.At 1061, packets 1060 are buffered into memory 1013 and a counter 1043is incremented for each packet buffered. At 1062, each received packetis checked for an entry in CT 600.

If at 1063 it is determined that no entry in CT 600 exists for a packet,then such a packet is sent to NPUsoft at 1064. Notably, a CT index maybe obtained from an xCFH or CFH for this lookup. At 1065, a packet to beprocessed with NPUsoft is buffered, and NPUsoft builds a CT entry forsuch a packet. Notably, though separate buffers are described for asoftware portion 1082 and a hardware portion 1081, a single buffer maybe used for both. Notably, a first packet, for example for a VOIPconnection, may be used to build such a CT entry, and subsequent packetsfor such VOIP connection would therefore not need to have another CTentry built. If, however, at 1063 it is determined that an entry forsuch a packet is in CT 600, then at 1073 it is determined if such a CTentry has a ready status flag set. If at 1073 it is determined that aready status flag is not set, then such a packet is sent to NPUsoft at1079.

Suppose that packets 1 through N, for N a positive integer, are bufferedat 1074. Notably, if a ready status flag is not in place forsubsequently received packets N+1, and so on, such packets are sent toNPUsoft for processing, until all packets buffered at 1074 have beencleared, as described below in additional detail.

A first packet of the sequence is obtained for processing at 1066,followed by a second packet of the sequence, and so on and so forth.This is because UDP packets, such as VOIP packets, may need to be playedback in sequence. At 1067, a processed packet is sent to an NPU at 1072.Notably, NPUsoft may fully process a packet or leave some portion ofpacket processing for an NPU. However, in this embodiment, the NPUprocesses the packet in its entirety. If the NPUsoft submitted a packetto hardware, a hash of the packet's five-tuple would lead to a CT entrythat was marked as “not ready,” and such a packet would come right backto the software. Accordingly, the NPUsoft completely processes each ofthese packets and sends them out marked such that they bypass the NPU.In other embodiments, the NPUsoft may be able to process packetssufficiently to create sufficient CT or NT state so that such processedpackets may then be re-submitted to the NPU to complete the processing.At 1068, NPUsoft checks for another packet in the buffer to process. Ifthere is another packet to process, then at 1069 such other packet isobtained from buffer memory for processing.

If there are no more packets to process at 1068, then a ready statusflag is set at 1071 for an associated CT entry, such as for a VOIPconnection. Accordingly, subsequently received packets will have a CTentry at 1063 and a ready status flag set at 1073, and thus such packetswill be processed by NPU at 1075.

After a packet is processed at 1075, it is forwarded along from NPU at1072 as a processed packet 1076. As each packet is forwarded, suchpacket is removed from buffer memory 1013 and counter 1043 isdecremented. Once all packets sent for processing by NPUsoft areprocessed, counter 1043 is zeroed as indicated by total count signal1045. Thus, NPU 1070 will know when all packets, such as for such a VOIPconnection, sent to NPUsoft have been completely processed, and willknow when all packets in buffer memory 1013 have been processed.

Thus, it should be understood that a state is created in software forhardware to process packets. However, this state is not activated foruse until all packets received to software have been processed out ofsoftware. However, once all such packets have been processed out ofsoftware, then hardware may be used for real-time traffic. Thoughentries for CT 600 may pass from NPUsoft to NPU 1070 for writing to CT600, tables may be created in software and maintained by software.

Referring to FIG. 13, there is shown a block diagram of an exemplaryembodiment of a computer system 1000 having an NPU 1070. Computer system1000 comprises CPU 1001, system memory 1003, a variety of supportcircuits 1006, I/O interface 1002, and media communications processor(“MCP”) 1004, all of which are coupled via a plurality of buses. MCP1004 includes NPU 1070. MCP 1004 may be coupled for I/O from/to anetwork 1005. CPU 1001 may be any type of microprocessor known in theart. Support circuits 1006 for computer system 1000 include conventionalcache, power supplies, clock circuits, data registers, I/O interfaces,and the like. Memory 1003 may be directly coupled to CPU 1001 or coupledthrough I/O interface 1002, and I/O interface 1002 may be coupled to aconventional keyboard, network, mouse, display printer, and interfacecircuitry adapted to receive and transmit data, such as data files andthe like.

Memory 1003 may store all or portions of one or more programs or data toimplement processes in accordance with one or more aspects of theinvention, including a network driver program 1007 having at least aportion of address translation flow 100. Network driver program 1007 mayinclude NPUsoft programming. Additionally, those skilled in the art willappreciate that one or more aspects of the invention may be implementedin hardware, software, or a combination of hardware and software. Suchimplementations may include a number of processors independentlyexecuting various programs and dedicated hardware, such as applicationspecific integrated circuits (“ASICs”).

Programmed computer system 1000 may be programmed with an operatingsystem, which may be OS/2, Java Virtual Machine, Linux, Solaris, Unix,Windows, Windows95, Windows98, Windows NT, and Windows2000, WindowsME,and WindowsXP, among other known platforms. At least a portion of anoperating system may be disposed in memory 1003. Memory 1003 may includeone or more of the following random access memory, read only memory,magneto-resistive read/write memory, optical read/write memory, cachememory, magnetic read/write memory, and the like, as well assignal-bearing media as described below.

One or more aspects of the invention are implemented as program productsfor use with computer system 1000. Program(s) of the program productdefines functions of embodiments in accordance with one or more aspectsof the invention and can be contained on a variety of signal-bearingmedia, such as computer-readable media having code, which include, butare not limited to: (i) information permanently stored on non-writablestorage media (e.g., read-only memory devices within a computer such asCD-ROM or DVD-RAM disks readable by a CD-ROM drive or a DVD drive); (ii)alterable information stored on writable storage media (e.g., floppydisks within a diskette drive or hard-disk drive or read/writable CD orread/writable DVD); or (iii) information conveyed to a computer by acommunications medium, such as through a computer or telephone network,including wireless communications. The latter embodiment specificallyincludes information downloaded from the Internet and other networks.Such signal-bearing media, when carrying computer-readable instructionsthat direct functions of one or more aspects of the invention representembodiments of the invention.

Referring to FIG. 14, there is shown a block diagram of an exemplaryembodiment of a network 1005. Network 1005 includes computer system 1000coupled local network nodes via LAN 1102 and coupled to remote networknode 1104 via WAN 1103. It should be appreciated that an NPU configuredwith address translation as described above may be used as a gateway,having firewalling or NAT'ing, to nodes on a LAN 1102. Additionally,computer system 1000 may be a remote node 1104 with stand-a-lonefirewalling or NAT'ing.

FIGS. 15A and 15B are block diagrams depicting exemplary embodiments ofrespective tables indexed by hash function output values 1110A and1110B. In tables indexed by hash function output values 1110A, a firstconnection 1111-1 is established, and a hash value of a five-tuple forconnection 1111-1 hashes to slot 1 in such tables indexed by hashfunction output values 1110A. Supposing slot 1 is empty, so slot 1 isused for connection 1111-1. Then, suppose a second connection 1111-2 isestablished, and a hash value of a five-tuple for connection 1111-2 alsohashes to slot 1. Notably, hash chains are used to account for instanceswhere multiple n-tuples, such as five-tuples, hash to the same value. Asslot 1 is already occupied with connection 1111-1, a collision occurs.Accordingly, an empty location in hash function output values 1110A isfound for connection 1111-2, which in this exemplary embodiment is slot2. So, slot 2 is used for connection 1111-2. Now, suppose a thirdconnection 1111-3 is established which hashes to slot 2. Accordingly, anempty location in hash function output values 1110A is found forconnection 1111-3, which in this exemplary embodiment is slot 3.However, this creates a chain of length three. In other words, to get toconnection 1111-3, a chain from connection 1111-1 to 1111-2 to 1111-3 isused, where at each link the packet's five-tuple is compared with thefive-tuple stored in that table entry matching the hash value that wascomputed using the five-tuple as input. Notably, though this is a hashchain of length three, it actually is an intermingling of two hashchains, namely, a chain pointing to slot 1 with slot 1 pointing to slot2, and a chain with slot 2 pointing to slot 3.

An alternative embodiment tables indexed by hash function output values1110B are depicted in FIG. 15B. So, if a connection 1111-3 isestablished and hashes to slot 2, and slot 2 is found to be occupied, anempty slot in tables indexed by hash function output values 1110B isfound, which in this exemplary embodiment is slot 3. Instead of puttingconnection 1111-3 into slot 3 and pointing slot 2 to slot 3, as done intables indexed by hash function output values 1110A, contents of slot 2are moved to slot 3. Moving contents of slot 2 to slot 3, empties slot 2for connection 1111-3, as shown. As connection 1111-3 hashed to slot 2,no other slot points to slot 2, and slot 1 now points to slot 3. Thus,there are two chains, namely, one of length two and one of length one.This reduces the length of a hash chain over that shown in FIG. 15A.Other advantages include improved performance with respect to length inwhich a hash chain has to be followed prior to arriving at a targetconnection, and reduced or eliminated of intermingling of hash chains.With respect to the last advantage, only one chain is needed to get toany of connections 1111 in tables indexed by hash function output values1110B, namely, a chain pointing to slot 1 with slot 1 point to slot 3,or a chain pointing to slot 2.

FIG. 16 is a flow diagram of an exemplary embodiment of a fragmentprocessing flow 1200. If at 408 or 504 then an associated errorcondition is identified for processing with software at 1201, asfollows. So, if an IP fragment is received, then at 1201, IPinformation, for example IP packet identification (conventionally atwo-bit packet identifier) and IP source and destination addresses, isobtained from such a fragment. At 1201, a check is made to determine ifanother IP fragment, based on such IP information obtained, is alreadystored in buffer space, such as in memory 1013 or 1003. If there is nomatch of IP information, then at 1202 buffer space is reserved, forexample in memory 1013 or 1003. Additionally, a timer is started at 1203responsive to a first received fragment for a fragmented packet. Ifthere is a match at 1201, then at 1205, a checksum, namely, a checksumfor a packet undergoing re-assembly, for a received fragment is obtainedand compared against a checksum of another fragment. If the obtainedchecksum is invalid, then such a fragment is dropped at 1206.

If a checksum for a fragment is valid at 1205 or is a first fragmentreceived for a fragmented packet, then at 1204 such a fragment isbuffered or otherwise stored, such as in memory 1013 or 1003.Accordingly, if IP information for this fragment matches that of apreviously buffered fragment, then this newly received fragment isbuffered in association with a buffer stack for a fragmented packetalready in process for reassembly. This may be a physical or a logicalassociation in memory for association on a fragmented packet basis. FIG.17 is a block diagram of an exemplary embodiment of a buffer stack 1230.If, however, IP information for this fragment does not match that of apreviously buffered fragment, then such fragment is buffered at 1204 innewly reserved buffer space as reserved at 1202.

At 1207, packet and packet fragment identifiers associated with such areceived fragment are obtained therefrom. At 1208, a fragment is sortedaccording to packet identifier and packet fragment identifier. In otherwords, buffered fragments are sorted into a bin for packet of origin,and then within that bin such fragments are sorted responsive tofragment number. Notably, a later arriving fragment may have a samefragment number as a previously arrived fragment, and thus the laterreceived fragment overwrites the previously received fragment.Furthermore, fragments may not be received in the order in which theywere generated. This numerical association of packet identifier tofragment may be a physical or a logical ordering within memory. Thisnumerical association of packet fragment identifier to fragment may be aphysical or a logical ordering within memory.

At 1215, an optional check is made to determine if a thresholdcommunication length for a summation of all packets in a buffer stackhas been exceeded. If a communication length threshold has been exceed,then the buffer stack is cleared at 1213; otherwise, processingcontinues at 1209.

At 1209, a buffer stack is checked to determine if any fragments for afragmented packet have as yet not been buffered. For example in bufferstack 1230, fragment 2 is as yet not buffered. The number of fragments apacket may have is indicated by fragment N for N a positive integer, andis dependent upon what protocol is being used, such as IPv4 or IPv6. Ifa fragment is missing, then at 1212 it is determined whether a bufferstack has timed out based on when time was started at 1203 for a firstfragment for such a buffer stack. If a buffer stack has timed out, thenat 1213 the buffer is cleared, meaning all fragments in such buffer aredropped. If, however, a buffer stack has not timed out, then at 1214 aset time interval is used as a wait period before checking again at 1209as to whether any fragments are still missing. Such a wait period willdepend on implementation and availability of memory. Also, the number offragments received to a destination is dependent upon likelihood ofrouting through an interface not able to handle full size packets.

If, however, at 1209 no fragments for a fragmented packet are missingfrom a buffer stack, then at 1210 such fragments are assembled into asingle packet, namely, a reassembled packet. At 1211, such a reassembledpacket is re-inserted into the above-described process, such as a packet101 into packet interrogation flow 120 for further processing, includingany firewalling. Thus, it should be appreciated that packet fragmentassembly is done prior to screening, namely, in front of a firewall.

Notably, though IP fragment flow has been described in terms ofsoftware, it may be instantiated in hardware or both hardware andsoftware. For example, hardware includes combinatorial logic forming aportion of an NPU. Hardware may have a performance advantage oversoftware but at additional cost. Furthermore, while a personal computerenvironment has been described, a dedicated firewall computer may beused. Additionally, one or more aspects may be employed in a personaldata assistant (PDA), a web-enabled phone, and other devices used forInternet communication.

Accordingly, it is worth mentioning that if NAT is used, NAT need bedone only once per packet. This is facilitated by having NAT proximal tofront end packet processing. Furthermore, it should be appreciated thatby doing NAT, and implicit routing table lookup is done.

Additionally, it should be appreciated that if firewalling is used,firewalling need be done only once per packet. This is facilitated byhaving firewalling proximal to back end packet processing.

While the foregoing describes exemplary embodiment(s) in accordance withone or more aspects of the invention, other and further embodiment(s) inaccordance with the one or more aspects of the invention may be devisedwithout departing from the scope thereof, which is determined by theclaim(s) that follow and equivalents thereof. For example, it is notnecessary to incorporate an NPU as described, as a software embodimentmay be used. Furthermore, the NPU architecture described herein is notthe only architecture that may be used. Additionally, rather than apersonal computer, a firewall computing device may be used. Claim(s)listing steps do not imply any order of the steps. Trademarks are theproperty of their respective owners.

1. A method for data lookup in a network, comprising: instantiating afirst data structure and a second data structure; populating the firstdata structure with state information for a packet; populating thesecond data structure with packet information for the packet; andcross-linking the first data structure and the second data structure,the cross-linking including: hashing at least a portion of the packetinformation to generate an index; and storing, in the first datastructure, the index in association with the state information, whereinthe index cross-links the first data structure and the second datastructure with a single value, wherein the first data structure can beaccessed from the second data structure via the single value withouthaving to check for matches involving any other values.
 2. The method,according to claim 1, wherein the first data structure is a connectiontable.
 3. The method, according to claim 1, wherein the second datastructure is a network address translation table.
 4. The method,according to claim 1, wherein the state information includes TransportControl Protocol state.
 5. The method, according to claim 1, wherein thepacket information comprises a five-tuple of information.
 6. The method,according to claim 1, further comprising the steps of: storing, in thesecond data structure, the index in association with the packetinformation; and generating a third data structure based on the indexstored in the second data structure.
 7. A computing device for datalookup in a network, comprising: a central processing unit (CPU); amemory coupled to the CPU; and a network processor unit coupled to theCPU and configured to: instantiate a first data structure and a seconddata structure, populate the first data structure with state informationfor a packet, populate the second data structure with packet informationfor the packet, and cross-link the first data structure and the seconddata structure, wherein the cross-linking includes hashing at least aportion of the packet information to generate an index and storing inthe first data structure the index in association with the stateinformation, wherein the index cross-links the first data structure andthe second data structure with a single value, wherein the first datastructure can be accessed from the second data structure via the singlevalue without having to check for matches involving any other values. 8.A method for creating data structures in a network, comprising:instantiating a first, a second and a third data structure; populatingthe first data structure with state information; populating the seconddata structure with network address translation information; populatingthe third data structure with interface information; and cross-linkingthe first data structure and the second data structure to the third datastructure, the cross-linking including: generating an index for theinterface information; and storing the index in the first data structurein association with the state information and in the second datastructure in association with the network address translationinformation, the index cross-linking the first data structure and thesecond data structure with a single value, wherein the generatingcomprises hashing at least a portion of the interface information, andthe first data structure can be accessed from the second data structurevia the single value without having to check for matches involving anyother values.
 9. The method, according to claim 8, further comprising:instantiating a fourth data structure; populating the fourth datastructure with routing information; and cross-linking the fourth datastructure to the third data structure, the cross-linking including:storing the index in the fourth data structure in association with therouting information.
 10. The method, according to claim 9, wherein thethird data structure is an address resolution table.
 11. The method,according to claim 10, wherein the first data structure is a connectiontable.
 12. The method, according to claim 11, wherein the populating ofthe first data structure comprises adding connection information to thefirst data structure.
 13. The method, according to claim 11, wherein theconnection information comprises a packet five-tuple of information. 14.The method, according to claim 11, wherein the second data structure isa network address translation table.
 15. The method, according to claim14, wherein the fourth data structure is a routing table.
 16. Themethod, according to claim 8, wherein the interface informationcomprises a media access control address.
 17. The method, according toclaim 16, wherein the interface information comprises a virtual localarea network identifier.
 18. The method, according to claim 17, whereinthe interface information comprises an interface mask.